- candidate solution
- гипотеза

*English-Russian dictionary of scientific and technical difficulties vocabulary.
И.А. Беляев.
2007.*

### Смотреть что такое "candidate solution" в других словарях:

**Candidate solution**— In optimization (a branch of mathematics), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem. The space of all candidate… … Wikipedia**Pacific Solution**— The Pacific Solution was the name given to the Australian government policy (2001 2007) of transporting asylum seekers to detention camps on small island nations in the Pacific Ocean, rather than allowing them to land on the Australian mainland.… … Wikipedia**People's Solution**— ( Solución Popular ) is a political party in Peru. At the last legislative elections, 8 April 2001, the party won 3.6 % of the popular vote and 1 out of 120 seats in the Congress of the Republic. Its presidential candidate at the elections of the … Wikipedia**Brute-force search**— In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… … Wikipedia**Differential evolution**— In computer science, differential evolution (DE) is a method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Such methods are commonly known as metaheuristics as they make… … Wikipedia**No free lunch in search and optimization**— This article is about mathematical analysis of computing. For associated folklore, see No free lunch theorem. The problem is to rapidly find a solution among candidates a, b, and c that is as good as any other, where goodness is either 0 or 1.… … Wikipedia**Local search (optimization)**— In computer science, local search is a metaheuristic for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate… … Wikipedia**CMA-ES**— stands for Covariance Matrix Adaptation Evolution Strategy. Evolution strategies (ES) are stochastic, derivative free methods for numerical optimization of non linear or non convex continuous optimization problems. They belong to the class of… … Wikipedia**Dual problem**— In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia**Mathematical optimization**— For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia**Electron backscatter diffraction**— An electron backscatter diffraction pattern An electron backscatter diffraction pattern of monocrystalline silicon, taken … Wikipedia

### Книги

- Hire With Your Head. Using Performance-Based Hiring to Build Great Teams, Lou Adler. Hire with Your Head Updated with new case studies and more coverage of the impact and importance of the Internet in the hiring process, this indispensable guide has shown tens of thousands of… Подробнее Купить за 2081.26 руб электронная книга